Constant bandwidth supply for priority processing
نویسندگان
چکیده
منابع مشابه
Best Possible Constant for Bandwidth Selection
For the data based choice of the bandwidth of a kernel density estimator, several methods have recently been proposed which have a very fast asymptotic rate of convergence to the optimal bandwidth. In the particular the relative rate of convergence is the square root of the sample size, which is known to be the possible. The point of this paper is to show how semiparametric arguments can be emp...
متن کاملSearching Paths of Constant Bandwidth
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check prot...
متن کاملBandwidth sharing networks with priority scaling
Abstract: In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms that conserve the quality of service experienced by the affected classes, while ensuring that the temporarily unstable class is not entirely neglect...
متن کاملBandwidth Utilization in Sorted-Priority Schedulers
This paper first introduces bandwidth utilization metric and then analyzes sorted-priority schedulers in the terms of the metric. The results show that the utilization is directly proportional to both the number of delay bound classes and the dependency of delay bound on rate but inversely proportional to packet size.
متن کاملProbabilistic Bandwidth Reservation by Resource Priority Multiplexing
Probabilistic bandwidth guarantees on variable bit-rate network ows o er signi cant improvements in throughput for only modest decreases in guarantee level. In this paper we present a probabilistic bandwidth reservation scheme for variable bit-rate ows called Resource Priority Multiplexing (RPM). The RPM algorithm uses packet marking on edge routers and selective dropping on core routers to pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Consumer Electronics
سال: 2011
ISSN: 0098-3063
DOI: 10.1109/tce.2011.5955235